A Propagation and Aggregation Algorithm for Inferring Opinions in Structural Graphs

نویسندگان

  • Nardine Osman
  • Carles Sierra
  • Angela Fabregues
چکیده

This paper is concerned with the issue of reputation and the computation of group opinion. We argue that entities may receive both objective and subjective opinions, and distinguishing between the two is crucial for achieving more precise measures. Additionally, we argue that the group opinion about an entity α is not only influenced by the opinions that α receives (whether objective or subjective), but by the reputation of other entities that α is related to. As such, we propose a method that permits the propagation and aggregation of opinions in structural graphs, allowing the inference of more precise reputation measures through the description of both objective and subjective group opinion.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Propagation of Opinions in Structural Graphs

Trust and reputation measures are crucial in distributed open systems where agents need to decide whom or what to choose. Existing work has overlooked the impact of an entity’s position in its structural graph and its effect on the propagation of trust in such graphs. This paper presents an algorithm for the propagation of reputation in structural graphs. It allows agents to infer their opinion...

متن کامل

Damage detection and structural health monitoring of ST-37 plate using smart materials and signal processing by artificial neural networks

Structural health monitoring (SHM) systems operate online and test different materials using ultrasonic guided waves and piezoelectric smart materials. These systems are permanently installed on the structures and display information on the monitor screen. The user informs the engineers of the existing damage after observing signal loss which appears after damage is caused. In this paper health...

متن کامل

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

متن کامل

GGRA: a grouped gossip-based reputation aggregation algorithm

An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...

متن کامل

Inferring Human Upper Body Motion Using Belief Propagation

We present an algorithm for automatic inference of human upper body motion in a natural scene. A graph model is proposed for inferring human upper body motion, and motion inference is posed as a mapping problem between state nodes in the graph model and features in image patches. A multiple-frame inference algorithm is proposed to combine both structural and temporal constraints in human upper ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010